Robust Recognition Using Eigenimages

نویسندگان

  • Ales Leonardis
  • Horst Bischof
چکیده

The basic limitations of the standard appearance-based matching methods using eigenimages are nonrobust estimation of coefficients and inability to cope with problems related to outliers, occlusions, and varying background. In this paper we present a new approach which successfully solves these problems. The major novelty of our approach lies in the way the coefficients of the eigenimages are determined. Instead of computing the coefficients by a projection of the data onto the eigenimages, we extract them by a robust hypothesize-and-test paradigm using subsets of image points. Competing hypotheses are then subject to a selection procedure based on the Minimum Description Length principle. The approach enables us not only to reject outliers and to deal with occlusions but also to simultaneously use multiple classes of eigenimages. c © 2000 Academic Press

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Recognition of Scaled Eigenimages through a Hierarchical Approach

Recently, we have proposed a new approach to estimation of the coeecients of eigenimages, which is robust against occlusion, varying background, and other types of non-Gaussian noise 4, 5]. In this paper we show that our method for estimating the coeecients can be applied to convolved and subsampled images yielding the same value of the coeecients. This enables an eecient multiresolution approa...

متن کامل

Illumination Insensitive Eigenspaces

Variations in illumination can have a dramatic effect on the appearance of an object in an image. In this paper we propose how to deal with illumination variations in eigenspace methods. We demonstrate that the eigenimages obtained by a training set under a single illumination condition (ambient light) can be used for recognition of objects taken under different illumination conditions. The maj...

متن کامل

Painting Recognition Using Eigenimages

We propose a method for identifying a painting in an image using eigenimages. We first pre-process the image to remove the background and then correct for skew and scaling. We then apply the method of eigenimages on de-meaned images. The algorithm correctly matched 97% of the images in a test database of 110 images, with an execution time of 3.6 s per image.

متن کامل

Illumination insensitive recognition using eigenspaces

Variations in illumination can have a dramatic effect on the appearance of an object in an image. In this paper, we propose how to deal with illumination variations in eigenspace methods. We demonstrate that the eigenimages obtained by a training set under a single illumination condition (ambient light) can be used for recognition of objects taken under different illumination conditions. The ma...

متن کامل

Dealing with occlusions in the eigenspace approach

The basic limitations of the current appearance-based matching methods using eigenimages are non-robust estimation of coeecients and inability to cope with problems related to occlusions and segmentation. In this paper we present a new approach which successfully solves these problems. The major novelty of our approach lies in the way how the coeecients of the eigenimages are determined. Instea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Vision and Image Understanding

دوره 78  شماره 

صفحات  -

تاریخ انتشار 2000